A P-Complete Language Describable with Iterated Shuffle

نویسنده

  • Takayoshi Shoudai
چکیده

We show that a P-complete language can be described by using the shuffle operator, shufle closure, union, concatenation, ICleene star and intersection on a finite alphabet.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pairs of Languages Closed under Shuffle Projection

Shuffle projection is motivated by the verification of safety properties of special parameterized systems. Basic definitions and properties, especially related to alphabetic homomorphisms, are presented. The relation between iterated shuffle products and shuffle projections is shown. A special class of multi-counter automata is introduced, to formulate shuffle projection in terms of computation...

متن کامل

Bounds on the Kolmogorov complexity function for infinite words

The Kolmogorov complexity function of an infinite word ξ maps a natural number to the complexity K(ξ n) of the n-length prefix of ξ. We investigate the maximally achievable complexity function if ξ is taken from a constructively describable set of infinite words. Here we are interested in linear upper bounds where the slope is the Hausdorff dimension of the set. As sets we consider Π1-definable...

متن کامل

P Systems with Shuffle Operation and Catalytic-Like Rules

Shuffle operation on trajectories is useful in modeling parallel composition of words and languages. In this work, a new class of P systems with shuffle operation and catalytic-like rules is presented. Such a system has a membrane structure, where language-objects and shuffleoperation rules are placed in its regions. It can be used as a language generator. In this study, we propose a variant P ...

متن کامل

The Frobenius problem for the shuffle operation

Given a set S of words, let S denote the iterated shuffle of S. We characterize the finite sets S for which S is co-finite, and we give some bounds on the length of a longest word not in S.

متن کامل

Pfaffian and Hafnian Identities in Shuffle Algebras

Chen’s lemma on iterated integrals implies that certain identities involving multiple integrals, such as the de Bruijn and Wick formulas, amount to combinatorial identities for Pfaffians and hafnians in shuffle algebras. We provide direct algebraic proofs of such shuffle identities, and obtain various generalizations. We also discuss some Pfaffian identities due to Sundquist and Ishikawa-Wakaya...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 41  شماره 

صفحات  -

تاریخ انتشار 1992